Sufficient conditions for the convergence of monotonic mathematicalprogramming algorithms
نویسندگان
چکیده
منابع مشابه
Sufficient conditions for the local convergence of constant modulus algorithms
The constant modulus (CM) criterion has become popular in the design of blind linear estimators of sub-Gaussian i.i.d. processes transmitted through unknown linear channels in the presence of unknown additive interference. The existence of multiple CM minima, however, makes it difficult for CM-minimizing schemes to generate estimates of the desired source (as opposed to an interferer) in multiu...
متن کاملSufficient conditions for the convergence of a class of nonlinear distributed consensus algorithms
In this paper, sufficient conditions for the convergence of a class of continuous-time nonlinear consensus algorithms for single integrator agents are proposed. More precisely, we consider the consensus algorithms in which the control input of each agent is a state-dependent combination of the relative positions of its neighbors in the information flow graph. It is shown that under some mild as...
متن کاملSufficient conditions for the convergence of the Magnus expansion
Two different sufficient conditions are given for the convergence of the Magnus expansion arising in the study of the linear differential equation Y ′ = A(t)Y . The first one provides a bound on the convergence domain based on the norm of the operator A(t). The second condition links the convergence of the expansion with the structure of the spectrum of Y (t), thus yielding a more precise chara...
متن کاملConditions for the convergence of evolutionary algorithms
This paper presents a theoretical analysis of the convergence conditions for evolutionary algorithms. The necessary and sufficient conditions, necessary conditions, and sufficient conditions for the convergence of evolutionary algorithms to the global optima are derived, which describe their limiting behaviors. Their relationships are explored. Upper and lower bounds of the convergence rates of...
متن کاملSufficient conditions for convergence of the Sum-Product Algorithm
Novel conditions are derived that guarantee convergence of the Sum-Product algorithm (also known as Loopy Belief Propagation or simply Belief Propagation) to a unique fixed point, irrespective of the initial messages, for parallel (synchronous) updates. The computational complexity of the conditions is polynomial in the number of variables. In contrast with previously existing conditions, our r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1976
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(76)80021-9